package a10_动态规划;

/**
 * <p>
 * a41_最长重复子数组复习1
 * </p>
 *
 * @author flyduck
 * @since 2025/3/4
 */
public class a43_最长重复子数组复习2 {
    public int findLength(int[] nums1, int[] nums2) {
        int result = 0;

        int[][] dp = new int[nums1.length+1][nums2.length+1];
        for (int i = 0; i <= nums1.length; i++) {
            dp[i][0] = 0;
        }

        for (int j = 0; j <= nums2.length; j++) {
            dp[0][j] = 0;
        }

        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if(nums1[i-1] == nums2[j-1]){
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                result = Math.max(result, dp[i][j]);
            }
        }

        return result;


    }
}
